Simplifying multiobjective optimization: An automated design methodology for the nondominated sorted genetic algorithm-II

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Design Methodology for the Nondominated Sorted Genetic Algorithm-II

Many real world problems require careful balancing of fiscal, technical, and social objectives. Informed negotiation and balancing of objectives can be greatly aided through the use of evolutionary multiobjective optimization (EMO) algorithms, which can evolve entire tradeoff (or Pareto) surfaces within a single run. The primary difficulty in using these methods lies in the large number of para...

متن کامل

An algorithm for approximating nondominated points of convex multiobjective optimization problems

‎In this paper‎, ‎we present an algorithm for generating approximate nondominated points of a multiobjective optimization problem (MOP)‎, ‎where the constraints and the objective functions are convex‎. ‎We provide outer and inner approximations of nondominated points and prove that inner approximations provide a set of approximate weakly nondominated points‎. ‎The proposed algorithm can be appl...

متن کامل

Designing A New Elitist Nondominated Sorted Genetic Algorithm For A Multiobjective Long Term Groundwater Monitoring Application

Although usage of genetic algorithms (GAs) has become widespread, the theoretical work from the genetic and evolutionary computation (GEC) field has been largely ignored by practitioners in realworld applications. This paper provides an overview of a three-step method for utilizing GEC theory to ensure robust search and avoid the common pitfalls in GA applications. Additionally, this study pres...

متن کامل

An Improved Nondominated Sorting Multiobjective Genetic Algorithm and Its Application

The nondominated sorting genetic algorithm with elitism (NSGA-II) is widely used due to its good performance on solving multiobjective optimization problems. In each iteration of NSGA-II, truncation selection is performed based on the rank and crowding distance of each solution. There are, however, drawbacks in this process. These drawbacks to some extent cause overlapping solutions in the popu...

متن کامل

An Elitist Genetic Algorithm for Multiobjective Optimization

Solving multiobjective engineering problems is a very difficult task due to, in general, in these class of problems, the objectives conflict across a high-dimensional problem space. In these problems, there is no single optimal solution, the interaction of multiple objectives gives rise to a set of efficient solutions, known as the Pareto-optimal solutions. During the past decade, Genetic Algor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Water Resources Research

سال: 2003

ISSN: 0043-1397

DOI: 10.1029/2002wr001483